Circuit Partitioning Using Atabu
نویسنده
چکیده
Tabu Search is a simple combinatorial optimization strategy that has been applied with great success in applications ranging from graph coloring to scheduling and space planning. This paper describes the application of the Tabu Searchh1] heuristic to the circuit partitioning problem. Results obtained indicate that in most cases Tabu Search yields netlist partitions with 10% fewer cut nets than the best netlist partitions obtained by using an interchange method or Simulated Annealing. Moreover , the Tabu Search method is 3 to 20 times faster than Simulated Annealing on tested problems. This paper also describes the beneet of integrating Tabu Search with Simulated Annealing.
منابع مشابه
Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملStudy of the Circuit Partitioning Using Genetic Algorithm
This paper discusses the various circuit partitioning problems. Circuit partitioning is a well known NP hard problem. The algorithms can partition circuit into number of sub-circuits. Different design styles of circuits have different objectives for the partitioning. Genetic algorithm for circuit partitioning is discussed in this paper. The objective of the Genetic Algorithm is to find an optim...
متن کاملEfficient FM Algorithm for VLSI Circuit Partitioning
In FM algorithm initial partitioning matrix of the given circuit is assigned randomly, as a result for larger circuit having hundred or more nodes will take long time to arrive at the final partition if the initial partitioning matrix is close to the final partitioning then the computation time (iteration) required is small . Here we have proposed novel approach to arrive at initial partitionin...
متن کاملPartitioning VLSI circuits on the basis of Genetic Algorithms and Comparative Analysis Of KL And SA Partitioning Algorithms
Circuit partitioning is the one of the fundamental problems in VLSI design. It appears in several stages in VLSI design, such as logic design and physical design. Circuit partitioning is generally formulated as the graph partitioning problem. Circuit partitioning problem is a well known NP hard problem. The potential of Genetic Algorithm has been used to solve many computationally intensive pro...
متن کاملOptimizing Circuit Partitioning by Implementing Data Mining and Vhdl Tools Pertinent to Vlsi Design
The relevance of VLSI in performance computing, telecommunications, and consumer electronics has been expanding progressively, and at a very hasty pace. In order to build complex digital logic circuits it is often essential to subdivide multi –million transistors design into manageable pieces. Circuit partitioning is a general approach used to solve problems that are too large and complex to be...
متن کامل